Quantum algorithms revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Erasure: Quantum Interference Revisited

It may be somewhat surprising that Thomas Young’s double-slit experiment a staple in the freshman physics laboratory would be such an invaluable testing ground for the foundations of quantum physics. Yet the quantum version of the double-slit experiment has been at the center of many debates over the fundamentals of quantum physics since the theory was born, nearly a century ago. In fact, Young...

متن کامل

Pyramid segmentation algorithms revisited

The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, together with the data structures and decimation procedures which encode and manage the information in the pyramid. In order to compare the different segmentation algorithms, we have employed three types of quality mea...

متن کامل

Quantum Mysteries Revisited Again

This paper describes a device, consisting of a central source and two widely separated detectors with six switch settings each, that provides a simple gedanken demonstration of the non-classical correlations that are the subject of Bell’s theorem without relying on either statistical effects or the occurrence of rare events. The mechanism underlying the operation of the device is revealed for r...

متن کامل

Quantum DNF Learnability Revisited

We describe a quantum PAC learning algorithm for DNF formulae under the uniform distribution with a query complexity of Õ(s/ǫ+ s/ǫ), where s is the size of DNF formula and ǫ is the PAC error accuracy. If s and 1/ǫ are comparable, this gives a modest improvement over a previously known classical query complexity of Õ(ns/ǫ). We also show a lower bound of Ω(s logn/n) on the query complexity of any...

متن کامل

Quantum repeated games revisited

We present a scheme for playing quantum repeated 2 × 2 games based on the Marinatto and Weber's approach [1] to quantum games. As a potential application , we study twice repeated Prisoner's Dilemma game. We show that results not available in classical game can be obtained when the game is played in the quantum way. Before we present our idea, we comment on the previous scheme of playing quantu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences

سال: 1998

ISSN: 1364-5021,1471-2946

DOI: 10.1098/rspa.1998.0164